Extending the Matching Facilities of Linda

نویسندگان

  • George Wells
  • Alan Chalmers
  • Peter Clayton
چکیده

This paper discusses the associative matching mechanism used in the Linda coordination language for the retrieval of data. There are a number of problems with this mechanism which are discussed in the light of the requirements of applications using Linda. A number of solutions to these problems have been proposed. These are discussed and compared with a new approach to solving these problems. The benefits and the limitations of the new approach are considered, showing how it provides a considerable improvement in this area.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

LINDA for Case Base Retrieval: A Case for Extending the Functionality of LINDA and its Abstract Machine

Case based reasoning (CBR) retrieval operations with partial ordering similarity measures have been implemented in LINDA to extract generic operations and identify potential parallelism in CBR. Mapping and reduction operations, and constraint matching versions of all retrieval operations were identified, then implemented in LINDA. Their operational semantics were expressed in terms of the CHAM ...

متن کامل

Centralized Clustering Method To Increase Accuracy In Ontology Matching Systems

Ontology is the main infrastructure of the Semantic Web which provides facilities for integration, searching and sharing of information on the web. Development of ontologies as the basis of semantic web and their heterogeneities have led to the existence of ontology matching. By emerging large-scale ontologies in real domain, the ontology matching systems faced with some problem like memory con...

متن کامل

Prolog-D-Linda v2: A New Embedding of Linda in SICStus Prolog

This paper presents an embedding of the Linda parallel programming paradigm into Prolog, resulting in a coarsely grained parallel Prolog1. The embedding provides a distributed tuple space, using unification for matching and Prolog style deduction in tuple space queries. Access to the tuple space is based on a general service mechanism, that facilitates flexible and unrestricted manipulation of ...

متن کامل

Extending the Radar Dynamic Range using Adaptive Pulse Compression

The matched filter in the radar receiver is only adapted to the transmitted signal version and its output will be wasted due to non-matching with the received signal from the environment. The sidelobes amplitude of the matched filter output in pulse compression radars are dependent on the transmitted coded waveforms that extended as much as the length of the code on both sides of the target loc...

متن کامل

Implementing distributed Linda in Standard ML

We have implemented the Linda model of shared distributed tuple space in a functional programming language, Standard ML. We use ML’s flexible type system and pattern matching facilities to provide ML programmers with the basic Linda operations on tuples. No preprocessor is used, and no compiler changes are required. We use separate ML modules to implement the Linda interface, operations on tupl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002